Constraint Programming Based Column Generation Heuristics for a Ship Routing and Berthing Time Assignment Problem
نویسندگان
چکیده
We develop a constraint programming based heuristic algorithm using column generation technique to solve a ship routing problem which the loading and unloading times of cargoes at pickup and drop-off locations are significant. In order to prevent congestions at the locations, we need to assign berthing time slots to each vessel to perform the loading and unloading tasks at different locations. This problem is motivated by the operations of a feeder vessel service company with company-owned cargo terminals, which the shipping company wishes to coordinate the routing and the berthing time of the vessels.
منابع مشابه
Enhanced chromosome repairing mechanism based genetic algorithm approach for the multi-period perishable production inventory-routing problem
One of the important aspects of distribution optimization problems is simultaneously, controlling the inventory while devising the best vehicle routing, which is a famous problem, called inventory-routing problem (IRP). When the lot-sizing decisions are jointed with IRP, the problem will get more complicated called production inventory-routing problem (PIRP). To become closer to the real life p...
متن کاملThe Tail Assignment Problem
The Aircraft Assignment problem is the problem of assigning flights to aircraft in such a way that some operational constraints are satisfied, and possibly that some objective function is optimized. We propose an approach to aircraft assignment which captures all operational constraints, including minimum connection times, airport curfews, maintenance, and preassigned activities. It also allows...
متن کاملAcceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows
The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in the vehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. At first the basic cutting plane algorithm and its relationship with column generation method is clari...
متن کاملFleet assignment and routing with schedule synchronization constraints
This paper introduces a new type of constraints, related to schedule synchronization, in the problem formulation of aircraft ̄eet assignment and routing problems and it proposes an optimal solution approach. This approach is based on Dantzig±Wolfe decomposition/column generation. The resulting master problem consists of ̄ight covering constraints, as in usual applications, and of schedule synch...
متن کاملA Node-based Mathematical Model towards the Location Routing Problem with Intermediate Replenishment Facilities under Capacity Constraint
In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...
متن کامل